A New Dynamic Stochastic Approximation Procedure
نویسندگان
چکیده
منابع مشابه
Dynamic Stochastic Approximation for Multi-stage Stochastic Optimization
In this paper, we consider multi-stage stochastic optimization problems with convex objectives and conic constraints at each stage. We present a new stochastic first-order method, namely the dynamic stochastic approximation (DSA) algorithm, for solving these types of stochastic optimization problems. We show that DSA can achieve an optimal O(1/ǫ4) rate of convergence in terms of the total numbe...
متن کاملShape - a Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
We consider the problem of approximating the expected recourse function for two-stage stochastic programs. Our problem is motivated by applications which have special structure such as an underlying network which allows reasonable approximations to the expected recourse function to be developed. In this paper, we show how these approximations can be improved by combining them with sample gradie...
متن کاملAn extension of Driml-Nedoma continuous stochastic approximation procedure
as a continuous analogy of Robbins-Monro stochastic approximation procedure [5]. They have proved that under certain general conditions on r(x) and C(f), the solution of (1.1) converges with probability one to the unique root of the regression function r(x). In this paper, we shall be concerned with the extension of this procedure to the case where the regression function r(x) has several (fini...
متن کاملA New Stochastic Modelling Procedure for Precise Static GPS Positioning
Carrier phase measurements are used for all high accuracy static GPS positioning applications. It is well known that there are two important aspects to the optimal processing of GPS measurements: the definition of the functional model, and the definition of the associated stochastic model. In most cases the functional model is sufficiently well known, while the definition of the stochastic mode...
متن کاملDynamic Slope Scaling Procedure to solve Stochastic Integer Programming Problem
Stochastic programming deals with optimization under uncertainty. A stochastic programming problem with recourse is referred to as a two-stage stochastic problem. We consider the stochastic programming problem with simple integer recourse in which the value of the recourse variable is restricted to a multiple of a nonnegative integer. The algorithm of a dynamic slope scaling procedure to solve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1979
ISSN: 0090-5364
DOI: 10.1214/aos/1176344839